Exact interdiction models and algorithms for disconnecting networks via node deletions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact interdiction models and algorithms for disconnecting networks via node deletions

This paper analyzes the problem of maximizing the disconnectivity of undirected graphs by deleting a subset of their nodes. We consider three metrics that measure the connectivity of a graph: The number of connected components (which we attempt to maximize), the largest component size (which we attempt to minimize), and the minimum cost required to reconnect the graph after the nodes are delete...

متن کامل

Heuristic and exact algorithms for Generalized Bin Covering Problem

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

متن کامل

Interdiction Models and Applications

Through interdiction models, we infer the vulnerabilities inherent in an operational system. This chapter presents four applications of interdiction modeling: (i) to delay an adversary’s development of a first nuclear weapon; (ii) to understand vulnerabilities in an electric power system; (iii) to locate sensors in a municipal water network; and (iv) to secure a border against a nuclear smuggle...

متن کامل

Models for nuclear smuggling interdiction

We describe two stochastic network interdiction models for thwarting nuclear smuggling. In the first model, the smuggler travels through a transportation network on a path that maximizes the probability of evading detection, and the interdictor installs radiation sensors to minimize that evasion probability. The problem is stochastic because the smuggler’s origin-destination pair is known only ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Optimization

سال: 2012

ISSN: 1572-5286

DOI: 10.1016/j.disopt.2012.07.001